Method and system for time-based data generation

ABSTRACT

A method, system, and computer-readable medium to generate time based data, including defining a time based data generation scenario, the time based data generation scenario including at least one event, the event representing an action at a specific time; a plurality of time segments, each time segment defining a particular temporal phase of the scenario and at least one time segment being embedded with the at least one event; and a time envelope to embed time segments; and generating time based data by executing the time based data generation scenario.

BACKGROUND

In the field of software applications, including but not limited tosoftware related to statistical analysis, there is a need and desire todemonstrate a functionality of the software application for one or morepurposes. The functionality of the software application may need to bedemonstrated to verify that the software functions as it is designed tofunction. The demonstration may be conducted for the benefit of asoftware designer, developer, or administrator, or for a potentialcustomer interested in procuring the software application. In an effortto thoroughly test the software application, a set or sets of data maybe provided to software application for consumption thereby.

In some situations, actual historical data relating to a business orother entity may be obtained that corresponds to the type and scope ofdata that a software application can consume while being verified.However, such data is often closely related to a business or otherentity, confidential and/or proprietary, not easily modified (if evenpermissible), and possibly not up-to-date.

Accordingly, in some contexts, there may exist a desire to generate timebased data conforming to well-defined data patterns that reflectreal-world behavior(s)

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 is an illustrative depiction of an scenario including differentphases of time, in accordance with some embodiments herein;

FIG. 2 is an illustrative depiction of time characteristics for anevent, in accordance with some embodiments herein;

FIG. 3 is an illustrative depiction of time characteristics for a timesegment, in accordance with some embodiments herein;

FIG. 4 is an illustrative depiction of time characteristics for a timeenvelope, in accordance with some embodiments herein;

FIG. 5 is an illustrative depiction of a scenario expressed in differenttime based data objects, in accordance with some embodiments herein;

FIG. 6 is an illustrative depiction of different states for time-baseddata objects, in accordance with some embodiments;

FIG. 7 is an illustrative depiction of a scenario expressed in differenttime based data objects including the states thereof, in accordance withsome embodiments;

FIG. 8 is an illustrative depiction of a database table buffermechanism, in accordance with some embodiments;

FIG. 9 is an illustrative logical organization of pattern-driven datagenerator artifacts for time-based data generation, in accordance withsome embodiments; and

FIG. 10 is an illustrative depiction of a sequence diagram, accordancewith some embodiments.

DETAILED DESCRIPTION

The following description is provided to enable any person in the art tomake and use the described embodiments. Various modifications, however,will remain readily apparent to those skilled in the art.

FIG. 1 is an illustrative depiction of a scenario 100 for which data maybe generated for, according to some of the aspects of the presentdisclosure. There are many different software applications that canprocess time based data. The time-based data may include, for example,alarm data regarding machines (e.g., a machine exceeded a maximumoperating temperature) and measurement data provided by sensors ofmachines (e.g., the temperature of a motor over time). In order to test,verify, and demonstrate at least some functionality of some softwareapplications, data adhering to well-defined data patterns that reflectsthe behavior of a real-world entity (e.g., a machine) may be desired.Some embodiments and aspects of the present disclosure relate to methodsand systems to selectively generate time-based data. That is, datacorresponding to well-defined data patterns having characteristics thatdepend on time may be generated by some aspects of the presentdisclosure. As used herein, well-defined data refers data representativeof actual real-world data that can be consumed by an application ormachine. The software application or machine may have certain specificexpectations for the data it consumes. As such, the data (actual,historical data or artificially generated) consumed by the applicationor machine needs to conform to certain, known constraints. Accordingly,the data that is to be generated in some embodiments herein is referredto as well-defined time-based data since it is defined to include thefeatures necessary for consumption by a particular application ormachine.

In some aspects, the amount of data that can be consumed by anapplication can include millions or even billions of records.Accordingly, some processes disclosed herein may be capable ofartificially generating massive amounts of time-based data. The data isartificially generated as opposed to being derived from actualhistorical data. In some aspects, the data generated in accordance withsome embodiments herein can be updated and otherwise modified since itis artificially generated data.

In an effort to clearly explain various concepts herein, scenario 100 ofFIG. 1 depicting the different phases of a work shift of a machine(e.g., a drilling machine) for which alert and measurement data is to begenerated may be referenced at various points in the discussion below.

Scenario 100 includes a work shift for the machine having a start time102 and an end time 104. Although a work shift begins at 102, it takes awhile for the machine to become operational. For example, before themachine can start to work it may have to be prepared to perform certaintasks (e.g., the machine may have to be configured with appropriatedrills before it can start drilling). Accordingly, the machine may beturned on at 105 and remain in a preparation phase during the range oftime indicated at 110. After the machine is prepared for operation at110, the machine enters an operational phase 115 for a period of timeuntil it is done with its work. Then, the machine is prepared for thenext operation as indicated by the second instance of the machinepreparation 110. In the present example, the machine may repeatedlyenter the preparation phase 110 and the operation phase 115 until theend of the shift at 104. At the end of the work shift, the machine isturned off during a machine turn off phase 120. During the differenttemporal phases of machine operation, alert data (i.e., alert data x=Ax)and measurement data (i.e., measurement data x=Mx) may be collected in areal-world environment. For simulation purposes, the present disclosureprovides mechanism(s) to create the time-based data (e.g., alert dataand measurement data) artificially according to given data-patterns thatare required for testing, verification and demo purposes.

In some aspects, different types of data may be generated by the methodand systems herein other than alert data and measurement data. Forexample, time based location data for a machine may be generated (e.g.,time-based global positioning system, GPS, data) in some instances.

In an effort to clearly describe the present disclosure, a number ofconcepts and terms will now be introduced and described in detail.

As referred to herein, “time based objects” are the building blocks usedto describe a time based data generation scenario. According to therequirements of a particular scenario, time based objects can bedesigned and assembled together to represent the scenario. A scenariomay be defined by one or more independent and/or co-dependent time basedobjects.

As referred to herein, an “event” represents an action at a certainpoint in time. For example, the advent of an alert or measurement dataof a machine that is provided by a sensor is an event. In general, anevent may refer to all types of data. In some embodiments herein, anevent has the following characteristics:

-   -   Timestamp—describes the point in time at which an event has        occurred    -   Identifier—name for the event (e.g., ‘Alarm Motor’)    -   Start point in time of data generation    -   Occurrence—how often does the event occur (e.g., each hour)    -   Duration—how long does the event last (e.g., 5 minutes)    -   Maximum time range—maximum time for event (e.g., start 8 AM,        stop 8 PM)    -   event specific parameters—e.g., error id, measurement value    -   creates event data the event is responsible for (e.g., sensor        data)

FIG. 2 is an illustrative depiction of the time characteristics 200 ofan event introduced above. As shown, the start point in time 202determines the earliest possible point in time an event can occur. Insome embodiments, the occurrence and duration of an event may becalculated by a Value Calculator process or device. For example, anOccurrence Value Calculator may calculate the time until an eventhappens (e.g., occurrence 210) and a Duration Value Calculator maycalculate for how long an event is valid (i.e., duration 215). In someaspects, a value calculator may calculate values that are a constantvalue and/or values that correspond to a normal distribution (i.e., aspecific relationship). The maximum time range 205 describes the timeperiod within which an event can occur. As shown, the occurrencecalculation (e.g., 220) is triggered at the end of an event durationperiod 215 and stops if a point in time is calculated that is outside ofthe maximum time range (i.e., greater than the point in time 204).

As referred to herein, a “Time Segment” is a time entity that defines aspecific range of time. A Time Segment spans a calculated period of timeand it embeds events that can occur within the time range of a TimeSegment. The events embedded in a Time Segment are processed in thechronological order in which they were registered with a particular TimeSegment. In some aspects, Time Segments may have no events assigned tothem and can be used to, for example, fill a given time range. A TimeSegment, in some embodiments herein, has the following characteristics:

-   -   Identifier—name (e.g., ‘Machine On’)    -   Start point in time    -   Time range length    -   Embedded events (optional)    -   Maximum time range    -   Plausibility check logic    -   End point in time    -   Triggers the data generation for the events it embeds

FIG. 3 is an illustrative depiction of the time characteristics 300 fora Time Segment, as introduced above. The time range length 310 may becalculated by using a value calculator process or machine. In someaspects, a value calculator may calculate values that are a constantvalue and/or values that correspond to a normal distribution (i.e., acertain relationship). The maximum time range 305 describes the timeperiod for which a Time Segment is responsible and starts at a startpoint in time 302 and ends at 304. In some aspects, a Time Segment maynot necessarily embed events. In some such cases, the Time Segment maybe used to fill a certain time range, e.g., the ‘Machine On’ 105 phasein FIG. 1 above having the occurrence of no events therein.

In some embodiments, depending on the setup and the runtimecharacteristics of a scenario, the maximum time range 305 may be smallerthan the calculated time range length 310 of a segment. An example ofthis type of situation exits if a phase ‘Machine Operation’ 115 in FIG.1 reaches the end of a work shift. In this case, there might be lesstime available than calculated by the time range length calculator. Insome embodiments, it is the responsibility of a Time Segment tocommunicate the maximum time range length to its potentially embeddedevents.

In some instances, plausibility check logic for the execution of a TimeSegment may be executed to determine whether a Time Segment is to beprocessed in the case that the Maximum Time Range 305 is smaller thanthe calculated Time Range Length 310. In some embodiments, thisplausibility logic may determine whether such a situation represents anerror in the data being generated or whether the execution is to bestopped.

In some embodiments, the end point in time 306 of a Time Segment may becalculated according to the following formula:End point in time=MIN((Start Point+Time Range Length),(StartPoint+Maximum Time Range))

In accordance with various aspects herein, a Time Envelope is a timeentity that encompasses and embeds one or more Time Segments. FIG. 4includes a graphical representation 400 of some aspects of a TimeEnvelope. A Time Envelope can optionally have a time range length 410,415 and, optionally, be repetitive (e.g., 410=415). Similar to othertime based objects, the Time Envelope has a Maximum Time Range 404extending from the start point in time 402 to the end point in time 404.Time Envelopes may, in some embodiments, embed Time Segments and otherTime Envelopes. The Time Segments and other Time Envelopes embedded in aTime Envelope are processed in the chronological order in which theywere registered with a Time Envelope.

In accordance with some embodiments herein, a Time Envelope has thefollowing characteristics:

-   -   Identifier—e.g., ‘Work Shift’    -   Start Point in Time    -   Time Range length (optional)    -   Repetitions (optional, default=0)    -   Embedded Time Segments and Time Envelopes    -   Maximum time range End Point in time calculation behavior    -   Plausibility check logic    -   End Point in Time    -   Triggers the data generation for the time based objects it        embeds

In some embodiments, a Time Envelope 400 might calculate its time rangelength if a time range length calculator has been assigned to it. Insome regards, a Time Envelope may optionally repeat the processing ofits embedded Time Segments (e.g., a first Time Segment in time range 410and second Time Segment 415) and Time Envelopes for either a givennumber of times or indefinitely. As used herein, “indefinitely” meansthat processing continues until the end of the maximum time range of theTime Envelope has been reached.

FIG. 4 depicts the time characteristics of a Time Envelope with andwithout time range length calculation and with repetitions. In someembodiments, depending on the setup and the runtime characteristics of ascenario, the maximum time range 405 of a Time Envelope may be smallerthan a calculated time range length (e.g., 410) of a Time Envelope. Forexample, this may be the case if the phase ‘Machine Operation’ 115 inFIG. 1 reaches the end of a work shift. In this instance, there might beless time available than calculated by the time range length calculatorfor the Time Envelope.

In some embodiments, it may be the responsibility of a Time Envelope tocommunicate the maximum time range to its potentially embedded TimeSegments and Time Envelopes. A plausibility check logic for theexecution of a Time Envelope may determine whether a Time Envelope is tobe processed in the instances the Maximum Time Range 405 is smaller thanthe calculated Time Range Length (e.g., 410, 415). It is up to thislogic to determine whether such a situation represents an error in thedata or whether the execution of the Time Envelope is to be stopped(e.g., in case of a Time Envelope with infinite repetitions). It isnoted that in case of repetitions, the time range length may becalculated separately for each iteration. The different time rangelengths may be different in size depending on a Value Calculator used.

In some embodiments, the end point in time 404 of a Time Envelope asillustrated in FIG. 4 can be calculated in one of the following manners:End Point in Time=Start Point+MIN(Time Range length,Maximum Time Range)orEnd Point in Time=End point of last embedded time based object

In some regards, the manner in which the end point in time is calculatedmay depend on a data generation scenario. For example, if we want tomake sure that a Time Envelope spans a well-defined amount of time(e.g., 8 hours for a work shift), then we can assign the followingcharacteristics to it:

-   -   Time Range Length=constant value=8 hr    -   Repetitions=0    -   End Point in Time=Start Point+MIN(Time Range length, Maximum        Time Range)

If however, we want to make sure that the End Point in time of a TimeEnvelope=end point in time of the last embedded element, then we canassign the following characteristics to it:

-   -   Time Range length calculator=arbitrary (yes/no)    -   Repetitions=arbitrary (0, n, infinite)    -   End Point in Time=End point of last embedded time based object

Another time based data object herein is an Outer Time Envelope which isthe top-level Time Envelope of a time based data generation scenariothat includes all of the time based objects needed to define a scenario.In some aspects, an Outer Time Envelope includes scenario specificparameters that may be defined by a user or other entity. All other timebased entities below an Outer Time Envelope are generic in nature. Sincethe Outer Time Envelope is the top-level aspect for a scenario, therecan be only one per entity node. It is noted that an Outer Time Envelopehas the same characteristics as a regular Time Envelope since it may beviewed as a special version or extension of a Time Envelope. However, anOuter Time Envelope may additionally have the followingresponsibilities:

-   -   Provides access to a DB Table Buffer into which event data is to        be generated. All involved time based entities (e.g., Events,        Time Segments and Time Envelopes) receive access to the buffer        via the Outer Time Envelope. The DB Table Buffer is forwarded to        an Outer Time Envelope by a so called Time Based Attribute Rule        which represents the link to the pattern-driven Data Generator        engine (will be further discussed below).    -   Receives data generation scenario specific parameters from a        consumer at a data generation scenario design time or from the        node property rule.    -   Calculates the start point in time for the time based data        generation depending on the parameters received.    -   Calculates the time range length of the overall scenario=Maximum        Time Range Length.    -   Triggers the data generation for the time based objects it        embeds.

FIG. 5 is an illustrative depiction of scenario 500, corresponding tothe scenario 100 in FIG. 1, wherein the time based object typesintroduced above are used to describe the example scenario. The OuterTime Envelope ‘Work Shift’ at 505 is the all-encompassing bracket forthe involved time based objects in the present example scenario. TheOuter Time Envelope has a well-defined length of 8 hours. The ‘MachineOn’ Time Segment is shown at 520 and lasts 7 minutes, with no events. Asan input parameter, it takes the time to start the data generation. TheTime Segments ‘Machine Preparation’ at 510 and ‘Machine Operation’ 515are to be repeated for an unknown number of times (e.g., until the endof the work shift is reached and the machine has to be turned off at525), the Time Segments are embedded in the Time Envelope ‘Production’517. In the present example, Time Envelope ‘Production’ 517 does nothave an explicit time range length and is to be repeated for an unknownnumber of times. Therefore, we set the number of repetitions equal toinfinite.

The scenario shown and labeled as depicted in FIG. 5 may be referencedthroughout the remainder of the present disclosure to describe andexplain different aspects of time based data generation.

A time based attribute rule may be provided, in accordance with someembodiments herein. This attribute rule can be provided generically,meaning that it can be used for all different kinds of time based datageneration scenarios. During a design time, attributes of an entitynode's for which a time based attribute rule is responsible arespecified. The time based attribute rules are the entity node attributesinto which the time based data is to be generated by the differentevents provided for the entity node. The time based attribute rule is amechanism to specify or define an attributes of data that are not itselftime based, per se. The following may be performed to enable time baseddata generation via the time based attribute rule:

-   -   1. Instantiate a Time Based Attribute rule for the entity node        for which the data is to be generated.    -   2. Instantiate an Outer Time Envelope and assemble the time        based objects according to the needs of a given data generation        scenario.    -   3. Pass the Outer Time Envelope to the time based attribute rule        as a parameter. The time based attribute rule passes the DB        Table Buffer to the Outer Time Envelope.    -   4. Start the data generation for the data generation scenario by        triggering the data generation for the Outer Time Envelope.

In accordance with some embodiments, a time based object herein may bere-entrant. That is, the data generation of the time based object andits embedded objects can be interrupted and later resumed at any pointin time. One reason for having time based objects that have thisbehavior is to facilitate the processing of database buffers where thebuffers are not sufficiently large enough to store all of the time baseddata that may be generated. For example, for some data generationuse-cases, billions of records may be generated using time based datageneration aspects disclosed herein. As such, all of those recordscannot be stored in a memory (e.g., RAM).

As an example, data records may be generated during a data generationprocess. After generating, for example, 10,000 records and storing themin memory, the data generation process may be interrupted, the data inthe buffers can be persisted in a storage facility, and the datageneration process may be resumed until a next 10 k records aregenerated and the process repeats.

FIG. 6 is an illustrative depiction of various different states for timebased objects herein and the transitions therebetween for a datageneration process 600. The data generation of time-based data starts at605. Initially, before the data is generated, the time based objects hasa state of “To_Be_Processed” as seen at 610. Thereafter, the data may begenerated. If an event detects that a DB Table Buffer is full, it thensets its state to ‘Paused’ 615 and stops the data generation process.The ‘Paused’ state is propagated to its parent object(s) up to the(top-level) Outer Time Envelope. When in the ‘Paused’ state, the data ispersisted before data generation can resume. The state of the attributerule that encapsulates the Outer Time Envelope is set to ‘Done’ 620 andafter all attribute rules of the entity node have been processed, the DBTable Buffer is persisted. After the data is persisted, data generationis triggered again by the DG Task and the time based objects in the‘Paused’ state continue their work.

FIG. 7 is an illustrative depiction of the scenario 700 introduced inFIG. 1, where the state of the different phases of a time based datageneration process are shown. Scenario 700 includes an Outer TimeEnvelope 705 that includes a number of Time Based Objects 710, 715, 720,725, and 730. Time Envelope 715 comprises Time Segments 720 and 725. Asthis example shows, the second event of Time Segment ‘Machine Operation’725 detects that the DB Table Buffer is full and its state is ‘Paused’.In response to the ‘Paused’ state of Time Segment 725, the states of theother different time based objects of scenario 700 will be changed asshown. In particular, the Time Segments 710, 720, and the first event A1of Time Segment 725 had already been completed prior to detection of thefull buffer by event M1. Accordingly, the state for the Time Segments710, 720, and 725 event A1 is ‘Done’. Also, event M1 of the Time Segment‘Machine Operation’ is ‘Paused” upon detection of the full buffer. Inresponse thereto, ‘Paused’ state is passed up to the Outer Time Envelope705 and Time Envelope 715. The state for the not yet processed event M2of Time Segment, ‘Machine Operation’ and the Time Segment, ‘Machine Off’is set at “To Be Processed”.

After the DB Table Buffer has been persisted after the freezing orpausing of all data generation, data generation will be triggered againfor the Outer Time Envelope 705. Due to the “re-entrant” behavior of thetime based objects herein, data generation can continue for TimeEnvelope ‘Production’ 715, which in turn triggers Time Segment ‘MachineOperation’ 725. Continuing, event M1 is asked to continue its datageneration. Data generation for event M2 will be subsequently generated.

In some embodiments, a Time Envelope that is designed to be processedrepeatedly may operate to reset the state of itself and the states ofits sub-ordinate time based objects to ‘To Be Processed’ at the end ofeach repetition as a mechanism to prepare them for the next datageneration iteration.

In some embodiments herein, event data (though not necessarilyexclusively) may be written into a so called DB Table Buffer. The adventand therefore also the amount of time based event data may be difficult,if not impossible, to calculate in advance because such data oftendepends on random functions, e.g. the advent of alert data (i.e., timestamps) may follow the law of exponential distribution. Accordingly, anaccurate calculation of the required DB Table Buffer size cannot easilybe accomplished in advance.

In contrast to non-time based data generation, it is not possible toprovide a single DB Table Buffer that can store all the data created bya DG Task. To prevent DB Table Buffer overflow in some embodiments, theinsertion of time-based event data into the buffer can be handled asfollows:

FIG. 8 is an illustrative depiction of a process 800 for processing timebased data generation using DB Table Buffers, in some embodiments. Insome aspects, a DB Table Buffer of arbitrary size (e.g., 10,000 rows)may be provided for a time based data generation process. Event data isplaced in a buffer 825 until it has been completely filled or until adata generation (DG) iteration 805 is completed. During a runtime of adata generation task 805 when a buffer 825 is determined to be full, thedata generation will be interrupted and the content of the buffer 825 ispersisted into a database 840. After the data is persisted in thedatabase 840, a new DB Table Buffer 830 is provided and data generationcan continue. These operations of creating data (815, 820), interruptingthe data generation when a buffer (830, 835) is full or until the DGiteration 805 is completed, and persisting the data from the buffer to adatabase 840 may be repeated as often as necessary to store the fullextent of the event data generated by a DG Task 805.

The state of the affected time based objects is set to ‘Paused’ if a DBTable Buffer is full. However, the DB Table Buffer cannot be persistedimmediately if it is full because there may be other non-time basedattribute rules involved in the data generation scenario that depend onthe time-based data. In this case, these other non-time based attributerules have to first be processed. After all attribute rules of an entityhave been processed, then the DB Table Buffer can be persisted and datageneration will be started again for the entity nodes. The time baseddata generation is continued from the point in time where it wasinterrupted.

In some embodiments, at least some time based objects herein may havedesign time parameters, e.g. an Outer Time Envelope. The time basedobjects might take as an input parameter the start point in time atwhich data generation is to be started. Events may take as inputparameters values that describe the characteristics of an alert, e.g.the Alert Id. That is, time based objects herein may, in someembodiments, be modeled, defined, or otherwise specified as being basedon some relationship or other non-fixed values.

FIG. 9 is an illustrative logical organization 900 of pattern-drivendata generator artifacts for time-based data generation, in accordancewith some embodiments herein. The logical organization 900 of FIG. 9includes generic data generation objects including a scenario 905, anentity 910, and node 915. Scenario 905 is the particular use-case orcontext for which data is being generated (e.g., a verification anddemonstration of a software application). The scenario may berepresented by entities 910 that may include Business Objects (BOs) thatcorresponds to real-world processes, documents, etc. BOs 910 may be datastructures defined by metadata specifying nodes 915 in terms of variousattributes and methods. In general, nodes 915 may comprise non-timebased attribute rules 920 and time based attribute rules 925. The timebased attribute rules 925 are a focus of the present disclosure and actas links to the generic pattern-driven data generator objects to thetime-based objects of a Outer Time Envelope 930, Time Envelope(s) 935,Time Segment(s) 940, and Event(s) 945, where each of time based objectsconform to the description thereof above.

In some embodiments, a design process for a time-based data generationscenario may include assembling time-based objects according to therequirements of a scenario, as defined by the Outer Time Envelope, TimeEnvelope(s), Time Segment(s) and Event(s) thereof. If required designtime parameters have to be passed to them. The sequence diagram shown inFIG. 10 depicts the steps required to design the example scenario shownabove.

After the design process data generation can be triggered at the TimeBased Attribute Rule which in turn triggers data generation for theOuter Time Envelope.

Aspects of the processes, systems, and services discussed hereinabovemay be implemented through any tangible implementation of one or more ofsoftware, firmware, hardware, and combinations thereof.

Although embodiments have been described with respect to certaincontexts, some embodiments may be associated with other types ofdevices, systems, and configurations, either in part or whole, withoutany loss of generality.

The embodiments described herein are solely for the purpose ofillustration. Those in the art will recognize other embodiments whichmay be practiced with modifications and alterations.

What is claimed is:
 1. A method of generating time based data, themethod comprising: defining a time based data generation scenario, thetime based data generation scenario comprising: at least one event, theevent representing an action at a specific time; a plurality of timesegments, each time segment defining a particular temporal phase of thescenario and at least one time segment being embedded with the at leastone event; and a time envelope to embed time segments, wherein the timeenvelope is a top-most outer time envelope that encompasses all timebased entities for the scenario; specifying in at least one time basedattribute rule a data attribute that is not time based, each of the atleast one time based attribute rule linking the time envelope to theembedded time segments and the at least one event; generating at least aportion of a time based data object by executing the time based datageneration scenario, the time based data object including datarepresenting at least one of the plurality of time segments, and theembedded at least one event, and the specified at least one time basedattribute rule; passing a memory buffer to the outer time envelope usinga time based attribute rule, the outer time envelope providing the timebased entities with access to the memory buffer; providing the generatedtime based data object to the memory buffer; interrupting the generatingof the time based data object after determining the memory buffer isfull; continuing the generating of the time based data object from whereit was interrupted; and at least one of verifying and demonstratingfunctionality of a software application by providing the generated timebased data object representing a data generation scenario forconsumption by the software application.
 2. The method of claim 1,wherein the action of the event is at least one of measurement data,alert data, and location data.
 3. The method of claim 1, wherein eachtime segment is defined by a maximum time range that specifies a timeperiod covered by the time segment and a time range length thatspecifies a calculated length of time for the particular temporal phaseof the scenario.
 4. The method of claim 1, wherein the time segments areindivisible.
 5. The method of claim 1, wherein the time envelopecomprises a plurality of other time envelopes.
 6. The method of claim 1,wherein the generating of the time based data can be interrupted byhalting a change in a state of the at least one event, the plurality oftime segments, and the time envelope and resumed from where halted. 7.The method of claim 1, wherein the data generated by the executing ofthe time based data generation scenario is written to a first memoryuntil the first memory is full, the data generating is interrupted, andthe data in the first memory is persisted to a storage facility.
 8. Themethod of claim 7, wherein the data generated by the executing of thetime based data generation scenario is iteratively written to the firstmemory until the first memory is full, the data generating isinterrupted, and the data in the first memory is persisted to a storagefacility until a full extent of data generated for the scenario ispersisted in the storage facility.
 9. A non-transitory computer-readablemedium having processor-executable instructions stored thereon, themedium comprising: instructions to define a time based data generationscenario, the time based data generation scenario comprising: at leastone event, the event representing an action at a specific time; aplurality of time segments, each time segment defining a particulartemporal phase of the scenario and at least one time segment beingembedded with the at least one event; and a time envelope to embed timesegments, wherein the time envelope is a top-most outer time envelopethat encompasses all time based entities for the scenario; instructionsto specify in at least one time based attribute rule a data attributethat is not time based, each of the at least one time based attributerule linking the time envelope to the embedded time segments and the atleast one event; instructions to generate at least a portion of a timebased data object by executing the time based data generation scenario,the time based data object including data representing at least one ofthe plurality of time segments, and the embedded at least one event, andthe specified at least one time based attribute rule; instructions topass a memory buffer to the outer time envelope using a time basedattribute rule, the outer time envelope providing the time basedentities with access to the memory buffer; instructions to provide thegenerated time based data object to the memory buffer; instructions tointerrupt the generating of the time based data object after determiningthe memory buffer is full; instructions to continue the generating ofthe time based data object from where it was interrupted; andinstructions to at least one of verify and demonstrate functionality ofa software application by providing the generated time based data objectrepresenting a data generation scenario for consumption by the softwareapplication.
 10. The medium of claim 9, wherein the action of the eventis at least one of measurement data, alert data, and location data. 11.The medium of claim 9, wherein each time segment is defined by a maximumtime range that specifies a time period covered by the time segment anda time range length that specifies a calculated length of time for theparticular temporal phase of the scenario.
 12. The medium of claim 9,wherein the time segments are indivisible.
 13. The medium of claim 9,wherein the time envelope comprises a plurality of other time envelopes.14. The medium of claim 9, further comprising instructions to interruptthe generating of the time based data by halting a change in a state ofthe at least one event, the plurality of time segments, and the timeenvelope and resumed from where halted.
 15. The medium of claim 9,further comprising instructions to write the data generated by theexecuting of the time based data generation scenario to a first memoryuntil the first memory is full, to interrupt the data generating, and topersist the data in the first memory to a storage facility.
 16. Themedium of claim 15, further comprising instructions to iteratively writethe data generated by the executing of the time based data generationscenario to a first memory until the first memory is full, to interruptthe data generating, and to persist the data in the first memory to astorage facility until a full extent of data generated for the scenariois persisted in the storage facility.